Efficient Robust d-Dimensional Path Operators
نویسندگان
چکیده
منابع مشابه
On the Path Components of Composition Operators on H(D)
We consider the topological space of composition operators C(H2) on the Hardy space H2(D) of the unit disc D with operator norm topology. We prove a necessary condition for two composition operators to lie in the same path components and as a consequence we are able to determine path components of composition operators induced by analytic self-maps of the unit disc D which are analytic in a nei...
متن کاملFast and robust three-dimensional best path phase unwrapping algorithm.
What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The technique follows a discrete unwrapping path to perform the unwrapping process. The performance of this technique was tested on both simulated and real wrapped-...
متن کاملOn the internal path length of d-dimensional quad trees
It is proved that the internal path length of a d–dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limiting distribution can be evaluated from the recursion and lead to first order asymptotics for the ...
متن کاملRobust and Efficient 3-D Reconstruction by Self-Calibration
We present a very robust and efficient scheme for 3-D reconstruction from point correspondences over multiple images taken by uncalibrated cameras. Our method is based on iterative projective reconstruction followed by Euclidean upgrading. We accelerate the time-consuming iterations for projective reconstruction by using the power method for eigenvalue computation, accelerating the power method...
متن کاملReliable Robust Path Planning
This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2012
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2012.2213578